repo.or.cz
/
andmenj-acm.git
/
blob
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
log
|
graphiclog1
|
graphiclog2
|
commit
|
commitdiff
|
tree
|
refs
|
edit
|
fork
blame
|
history
|
raw
|
HEAD
836 - Largest submatrix (DP, programación dinámica, O(n^4) ¿Existirá un O(n^3)?)
[andmenj-acm.git]
/
11172 - Relational operator
/
11172.cpp
blob
dfc9e379c8af20c62048bd33dd785bd4c7e9c46f
1
#include <cstdlib>
2
#include <iostream>
3
4
using namespace
std
;
5
6
int
main
(
int
argc
,
char
*
argv
[])
7
{
8
int
t
;
9
cin
>>
t
;
10
long
a
,
b
;
11
for
(
int
i
=
0
;
i
<
t
;
i
++){
12
cin
>>
a
>>
b
;
13
if
(
a
<
b
)
cout
<<
"<
\n
"
;
14
else if
(
a
>
b
)
cout
<<
">
\n
"
;
15
else
cout
<<
"=
\n
"
;
16
}
17
return
0
;
18
}